A due-date assignment problem with learning effect and deteriorating jobs
نویسندگان
چکیده
منابع مشابه
Due-date assignment and parallel-machine scheduling with deteriorating jobs
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...
متن کاملA note on due-date assignment and single-machine scheduling with deteriorating jobs
We study a scheduling problem with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n logn) t...
متن کاملSingle-Machine Scheduling with Due-Date Assignment and Aging Effect under a Deteriorating Maintenance Activity Consideration
This study investigates single-machine due-date assignment and scheduling problems with a job-dependent aging effect under a deteriorating maintenance activity consideration simultaneously. The maintenance activity can be scheduled immediately after any one of the jobs has been completed. In order to model the problem more realistic, we assume that: (1) once the maintenance activity has been co...
متن کاملA faster algorithm for a due date assignment problem with tardy jobs
Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...
متن کاملA unified solution approach for the due date assignment problem with tardy jobs
We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.04.020